Combining Decision Trees using Systematic Patterns

نویسنده

  • Hyunjoong Kim
چکیده

Tree ensemble or combining methods that use re-sampling technique have been highlighted recently in Statistical classification and Data mining. In this paper, we propose a new ensemble method in decision trees that utilizes systematic patterns of classification. The new method improved the prediction accuracy of a single decision tree algorithm. It is also observed that this method performs reasonably well with fewer number of re-samples compared to the popular Bagging or Boosting methods. An experiment with real dataset is carried out to see the performance of the new method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifying diagnostic errors with induced decision trees.

OBJECTIVE The purpose of this article is to compare the diagnostic accuracy of induced decision trees with that of pruned neural networks and to improve the accuracy and interpretation of breast cancer diagnosis from readings of thin-needle aspirate by identifying cases likely to be misclassified by induced decision rules. METHOD Using an online database consisting of 699 cases of suspected b...

متن کامل

Predicting The Type of Malaria Using Classification and Regression Decision Trees

Predicting The Type of Malaria Using Classification and Regression Decision Trees Maryam Ashoori1 *, Fatemeh Hamzavi2 1School of Technical and Engineering, Higher Educational Complex of Saravan, Saravan, Iran 2School of Agriculture, Higher Educational Complex of Saravan, Saravan, Iran Abstract Background: Malaria is an infectious disease infecting 200 - 300 million people annually. Environme...

متن کامل

Handling uncertain labels in multiclass problems using belief decision trees

This paper investigates the induction of decision trees based on the theory of belief functions. This framework allows to handle training examples whose labeling is uncertain or imprecise. A former proposal to build decision trees for twoclass problems is extended to multiple classes. The method consists in combining trees obtained from various two-class coarsenings of the initial frame.

متن کامل

FAT-CAT: Frequent Attributes Tree Based Classification

The natural representation of XML data is to use the underlying tree structure of the data. When analyzing these trees we are ensured that no structural information is lost. These tree structures can be efficiently analyzed due to the existence of frequent pattern mining algorithms that works directly on tree structured data. In this work we describe a classification method for XML data based o...

متن کامل

Distributed Data-Mining by Probability-Based Patterns

In this paper a new method is suggested for distributed data-mining by the probability patterns. These patterns use decision trees and decision graphs. The patterns are cared to be valid, novel, useful, and understandable. Considering a set of functions, the system reaches to a good pattern or better objectives. By using the suggested method we will be able to extract the useful information fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001